Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks
نویسندگان
چکیده
منابع مشابه
Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks
Peer-to-Peer networks attracted a significant amount of interest because of their capacity for resource sharing and content distribution. Content distribution applications allow personal computers to function in a coordinated manner as a distributed storage medium by contributing, searching, and obtaining digital content. Searching in unstructured P2P networks is an important problem, which has...
متن کاملAnalysis models for unguided search in unstructured P2P networks
Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random graph based P2P networks. We then present two analytical models: the algebraic model and the combinatorial model. These models are useful in setting query parameters and evaluating search efficiency. We evaluate these two m...
متن کاملSurvey of Search and Replication Schemes in Unstructured P2P Networks
P2P computing lifts taxing issues in various areas of computer science. The largely used decentralized unstructured P2P systems are ad hoc in nature and present a number of research challenges. In this paper, we provide a comprehensive theoretical survey of various state-of-the-art search and replication schemes in unstructured P2P networks for file-sharing applications. The classifications of ...
متن کاملOn probabilistic flooding search over unstructured peer-to-peer networks
Probabilistic flooding has been proposed as a means of reducing the excessive message overheads induced by plain flooding in unstructured peer-to-peer network search. We propose here Advanced Probabilistic Flooding (apf), a novel strategy which operates differently from other known strategies. In particular, the decision of a node to propagate a message (or not) is based on both the popularity ...
متن کاملImproved Degree Search Algorithms in Unstructured P2P Networks
Searching and retrieving the demanded correct information is one important problem in networks; especially, designing an efficient search algorithm is a key challenge in unstructured peer-to-peer P2P networks. Breadth-first search BFS and depth-first search DFS are the current two typical search methods. BFS-based algorithms show the perfect performance in the aspect of search success rate of n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Peer-to-Peer Networking and Applications
سال: 2011
ISSN: 1936-6442,1936-6450
DOI: 10.1007/s12083-011-0101-y